Cellular telephone networks and random maps in hypergraphs

Cellular telephone networks and random maps in hypergraphs

Hypergraphs and Cellular Networks

1 Max Planck Institute for Dynamics of Complex Technical Systems, Magdeburg, Germany, 2 Institute for Mathematical Optimization, Faculty of Mathematics, Otto-vonGuericke University Magdeburg, Magdeburg, Germany, 3 Institute for Bioinformatics and Systems Biology, Helmholtz Zentrum München—German Research Center for Environmental Health, Neuherberg, Germany, 4 Max Planck Institute for Dynamics a...

On Performance Prediction of Cellular Telephone Networks

This paper considers large cellular mobile networks in which the arrival rates of calls for di erent cells are di erent The lower and upper bound of how much the given number of channels would satisfy the arriving calls are presented Numerical examples are given

Random maps and attractors in random Boolean networks.

Despite their apparent simplicity, random Boolean networks display a rich variety of dynamical behaviors. Much work has been focused on the properties and abundance of attractors. The topologies of random Boolean networks with one input per node can be seen as graphs of random maps. We introduce an approach to investigating random maps and finding analytical results for attractors in random Boo...

Choosability in Random Hypergraphs

The choice number of a hypergraph H = (V, E) is the least integer s for which for every family of color lists S = {S(v) : v ∈ V }, satisfying |S(v)| = s for every v ∈ V , there exists a choice function f so that f(v) ∈ S(v) for every v ∈ V , and no edge of H is monochromatic under f . In this paper we consider the asymptotic behavior of the choice number of a random k-uniform hypergraph H(k, n,...